#include <bits/stdc++.h>
#define int long long
using namespace std;

inline int read() {
	int x = 0, f = 0; char ch = getchar();
	while (ch < '0' or ch > '9') f |= (ch == '-'), ch = getchar();
	while (ch >= '0' and ch <= '9') x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

int __stk[128], __top;
inline void write(int x) {
    if(x < 0) putchar('-'), x = -x;
	do { __stk[++__top] = x % 10, x /= 10; } while (x);
	while (__top) putchar(__stk[__top--] + '0');
}

const int mod = 998244353;

void Min(int &x, int y) { y < x and (x = y); }
void Max(int &x, int y) { y > x and (x = y); }

void inc(int &x, int y) { (x += y) >= mod and (x -= mod); }
void mul(int &x, int y) { x = 1ll * x * y % mod; }

int q_pow(int x, int k) { int res = 1; for (; k; k >>= 1, mul(x, x)) if (k & 1) mul(res, x); return res; }

bool stmer;

const int N = 1e7 + 10;

int n, m, ans, tot;
int a[N], b[N];

void solve() {
    m = ans = tot = 0;

    n = read(), a[0] = read();
    int A = read(), B = read(), C = read(), M = read();

    for (int i = 1; i <= n; i++) {
        a[i] = A * a[i - 1] % M * a[i - 1] % M;
        a[i] = (a[i] + B * a[i - 1]) % M, a[i] = (a[i] + C) % M;
    }

    sort(a + 1, a + n + 1), a[0] = -1;
    for (int i = 1; i <= n; i++) {
        if (a[i] != a[i - 1]) b[++m] = 0;
        b[m]++;
    }

    b[0] = b[m + 1] = 0;
    for (int i = 1; i <= m; i++) {
        int tot = b[i] * (b[i - 1] + b[i] + b[i + 1])
    }
}

bool edmer;
signed main() {
	freopen("guess.in", "r", stdin);
	freopen("guess.out", "w", stdout);
	cerr << "[Memory] " << (&stmer - &edmer) / 1024 / 1024 << " MB\n";
	
    int T = read();
    while (T--) solve();

    cerr << "[Runtime] " << (double) clock() / CLOCKS_PER_SEC << " seconds\n";
	return 0;
} 